Crossed cubes network is a kind of interconnection structure as a basis for\ndistributed memory parallel computer architecture. Reliability takes an important\nrole in fault tolerant computing on multiprocessor systems. Connectivity\nis a vital metric to explore fault tolerance and reliability of network\nstructure based on a graph model. Let G = (V, E) be a connected graph. The\nk-conditional edge connectivity �Žk (G) is the cardinality of the minimum\nedge cuts F , if any, whose deletion disconnects G and each component of\nG - F has property of minimum degree �´ â�¥ k . The k -conditional connectivity\nKk (G) can be defined similarly. In this paper, we determine the kconditional\n(edge) connectivity of crossed cubes CQn for small k. And we\nalso prove other properties of CQn.
Loading....